Let's see.

And I'll also.

No, that's not.

No.

It is using the job.

So that's.

That's good.

Yeah, so now we're recording.

So we won't kind of play the compiler.

I don't actually have to run.

But if you're writing something that looks very much like prologue in the GF section.

So it needs to be kind of with a lot of goodwill.

Be interpretable as a grammar and have the have the most salient features of what GF grammars are.

Yeah, we'll see what we can come up with.

Any more questions?

Yeah, it's a bit.

Not complicated.

Yeah, that I can answer.

There are multiple answers to that.

You can think of it from an application point of view.

Yeah.

In sentence and any logical representations whatsoever.

Then.

Box A typically means things like it is necessary that it.

Students must do something.

Diamond is it is possible that or students can do.

Something and so on.

So that's kind of from the application side, which is mirrored in.

The semantic side, which is if we have.

A crypt key structure.

Kind of typically.

May look locally at least something like this.

Maybe another.

All of those are models for whatever a logic is.

What the logic is in the model.

We interpret the accessibility relations.

And it's color.

The red green line here, right?

So.

What is true.

For every six of the world.

It is true.

Diamond A.

Is true.

And one.

At least.

At least one.

Okay, so that's the difference.

But.

Really, it's kind of the necessary against possible.